Radically solvable graphs
نویسنده
چکیده
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge lengths. We show that the radical solvability of a generic framework depends only on its underlying graph and characterise which planar graphs give rise to radically solvable generic frameworks. We conjecture that our characterisation extends to all graphs. 2010 Mathematics Subject Classification: 05C10, 12F10, 52C25, 68R10.
منابع مشابه
Designing Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملSOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملPerfect graphs are kernel solvable
In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also conjectured in the same paper, and is still open. In this direction we prove that it is always possible to substitute some of the vertices of a non-perfect graph by cliques so that the resulting graph is ...
متن کاملHigh Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem
One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this problem is to try to solve a certain system of polynomial equations [44]. Current attempts try to solve them directly with existing software tools which does not work well due to their very loosel...
متن کاملJ an 2 00 3 Explicit , analytical solution of scaling quantum graphs
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کامل